Implicit Test Sequences Compaction for Decreasing

نویسندگان

  • R. Bevacqua
  • L. Guerrazzi
  • F. Ferrandi F. Fummi
چکیده

Test pattern storage is an important problem aaect-ing all Design for Testability (DfT) techniques based on scan-path. Test compaction is the key idea to reduce this problem, but in case of partial-scan test compaction would concern the concatenation and overlapping of test sequences instead of test vectors. Unfortunately, standard sequential TPGs do not show suucient capabilities in test sequences compaction. Thus, the paper presents an innovative compaction strategy for test sequences based on implicit techniques. Preliminary results show that the use of the presented technique can sensibly reduce the amount of test patterns which must be stored and applied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Procedures for Static Compaction of Test Sequences for Synchronous Sequential Circuits

ÐWe propose three static compaction techniques for test sequences of synchronous sequential circuits. We apply the proposed techniques to test sequences generated for benchmark circuits by various test generation procedures. The results show that the test sequences generated by all the test generation procedures considered can be significantly compacted. The compacted sequences thus have shorte...

متن کامل

Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors

Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a small set of states, and some states are frequently re-visited throughout the application of a test set. Subse-quences that start and end on the same states may be removed if necessary and suucient conditions are met for...

متن کامل

Fast and Efficient Static Compaction of Test Sequences Using Bipartite Graph Representations

Current paper presents a novel idea of test set minimization, which is based on representing fault matrices of test sets by bipartite graphs. We show that bipartite graphs provide for a remarkable speed-up of the compaction of test sequences in comparison with matrix representations. Results show that, in a number of realistic cases, the proposed algorithm is capable of proving that global mini...

متن کامل

Putting the Squeeze on Test Sequences

Dynamic test sequence compaction is an effective means of reducing test application time and often results in higher fault coverages and reduced test generation time as well. A new algorithm for dynamic test sequence compaction is presented that uses genetic techniques to evolve test sequences. Test sequences provided by a test generator and previously evolved sequences already included in the ...

متن کامل

Improving a GA-based ATPG for Sequential Circuits by Exploiting Dynamically Generated "Essential Sequences"

This paper presents an algorithm that compacts the Test Sequences generated by a GA-based ATPG program for sequential circuits. In this algorithm, from a set of test sequences, a properly selected subset of sequences is reordered and combined without reducing the number of detected faults. By introducing the metric of fault density sequence selection is guided towards sequences that have higher...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996